Dimensionality reduction via compressive sensing
نویسندگان
چکیده
0167-8655/$ see front matter 2012 Elsevier B.V. A doi:10.1016/j.patrec.2012.02.007 q This work is partially supported by Charles S Research Grant OPA 4818. 1 NICTA is funded by the Australian Government as re of Broadband, Communications and the Digital Econom Council through the ICT Centre of Excellence program. ⇑ Corresponding author. E-mail addresses: [email protected] (J. Gao), q [email protected] (T.S. Caetano). Compressive sensing is an emerging field predicated upon the fact that, if a signal has a sparse representation in some basis, then it can be almost exactly reconstructed from very few random measurements. Many signals and natural images, for example under the wavelet basis, have very sparse representations, thus those signals and images can be recovered from a small amount of measurements with very high accuracy. This paper is concerned with the dimensionality reduction problem based on the compressive assumptions. We propose novel unsupervised and semi-supervised dimensionality reduction algorithms by exploiting sparse data representations. The experiments show that the proposed approaches outperform state-of-the-art dimensionality reduction methods. 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Reconstruction of sparse signals from l1 dimensionality-reduced Cauchy random-projections
Dimensionality reduction via linear random projections are used in numerous applications including data streaming, information retrieval, data mining, and compressive sensing (CS). While CS has traditionally relied on normal random projections, corresponding to 2 distance preservation, a large body of work has emerged for applications where 1 approximate distances may be preferred. Dimensionali...
متن کاملReconstructions from Compressive 2 Random Projections of Hyperspectral 3 Imagery 4
7 processing. Conventional dimensionality reduction on-board remote devices is 8 often prohibitive due to limited computational resources; on the other hand, 9 integrating random projections directly into signal acquisition offers an alternative 10 to explicit dimensionality reduction without incurring sender-side computational 11 cost. Receiver-side reconstruction of hyperspectral data from su...
متن کاملImage Tampering Detection Using Compressive Sensing Based Watermarking Scheme
In this paper, we describe an image watermarking scheme using compressive sensing for detection of image tampering. We exploit dimensionality reduction and inherent computational security offered by compressive sensing. The frequency band containing the high energy is used to compute the hash and then its pseudo-random projections are obtained. These projections are embedded as a watermark into...
متن کاملEnergy-aware adaptive Johnson-Lindenstrauss embedding via RIP-based designs
We consider a dimensionality reducing matrix design based on training data with constraints on its Frobenius norm and number of rows. Our design criteria is aimed at preserving the distances between the data points in the dimensionality reduced space as much as possible relative to their distances in original data space. This approach can be considered as a deterministic Johnson-Lindenstrauss e...
متن کاملCompressive Spectral Clustering - Error Analysis
Compressive spectral clustering combines the distance preserving measurements of compressed sensing with the power of spectral clustering. Our analysis provides rigorous bounds on how small errors in the affinity matrix can affect the spectral coordinates and clusterability. This work generalizes the current perturbation results of two-class spectral clustering to incorporate multiclass cluster...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 33 شماره
صفحات -
تاریخ انتشار 2012